K Nearest Neighbor Path Queries based on Road Networks
نویسندگان
چکیده
The Island is a k nearest neighbor query algorithm of moving objects based on road networks and can effectively balance the performance of query and update. But the algorithm doesn’t consider the direction of moving object which is required in many scenarios. It traverses vertexes from all directions, meaning wasting a lot of time in visiting useless vertexes. Besides, it doesn’t return query path. In this paper, we propose an improved Island algorithm which takes full account of moving direction. It takes best point estimate and heuristic search method, effectively reducing the number of traversal vertexes. At the same time, we optimize the data structure and let it return the query path. Results show that the improved algorithm outperforms the original one. Finally, we describe electric vehicle charging guidance system based on the improved Island algorithm.
منابع مشابه
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance precomputation. The former may cause an explosive number of node accesses for sparse datasets because all nodes closer than the NN to the query must be visited. The latter, e.g., the Voronoi Network Nearest Neighbor (V N)...
متن کاملContinuous Monitoring of Nearest Neighbors on Land Surface
As geo-realistic rendering of land surfaces is becoming commonplace in geographical information systems (GIS), games and online Earth visualization platforms, a new type of k Nearest Neighbor (kNN) queries, “surface” k Nearest Neighbor (skNN) queries, has emerged and been investigated recently, which extends the traditional kNN queries to a constrained third dimension (i.e., land surface). All ...
متن کاملSALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks
Although recent scientific output focuses on multiple shortest-path problem definitions for road networks, none of the existing solutions does efficiently answer all different types of SP queries. This work proposes SALT, a novel framework that not only efficiently answers SP related queries but also k-nearest neighbor queries not handled by previous approaches. Our solution offers all the bene...
متن کاملk-NN Search in Time-Dependent Road Networks
The ever-growing popularity of online map services and their wide deployment in smartphones and car-navigation systems have led to extensive use of location-based services. One of the most popular classes of such services is k-nearest neighbor (kNN) queries where users search for geographical points of interests (e.g., restaurants) and the corresponding directions and travel times to these loca...
متن کاملEfficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks
A reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k closest points. In recent years, considerable research has been conducted into monitoring reverse k nearest neighbor queries. In this paper, we study the problem of continuous reverse nearest neighbor queries where both the query object q and data objects are moving. Existing state-of-the-art t...
متن کامل